Bounding the Rational Sums of Squares over Totally Real Fields
نویسنده
چکیده
Let K be a totally real Galois number field. C. J. Hillar proved that if f ∈ Q[x1, . . . , xn] is a sum of m squares in K[x1, . . . , xn], then f is a sum of N(m) squares in Q[x1, . . . , xn], where N(m) ≤ 2[K:Q]+1 · `[K:Q]+1 2 ́ ·4m, the proof being constructive. We show in fact that N(m) ≤ (4[K : Q]−3)·m, the proof being constructive as well.
منابع مشابه
Sums of Squares over Totally Real Fields Are Rational Sums of Squares
Let K be a totally real number field with Galois closure L. We prove that if f ∈ Q[x1, . . . , xn] is a sum of m squares in K[x1, . . . , xn], then f is a sum of 4m · 2[L:Q]+1 ([L : Q] + 1 2 ) squares in Q[x1, . . . , xn]. Moreover, our argument is constructive and generalizes to the case of commutative K-algebras. This result gives a partial resolution to a question of Sturmfels on the algebra...
متن کاملPythagoras Numbers of Fields
The study of sums of squares in a ring or a field is a classic topic in algebra and number theory. In this context, several questions arise naturally. For example, which elements can be represented as sums of squares, and if an element can be written as a sum of squares, how many squares are actually needed ? For instance, for an integer n to be a sum of squares of integers, we must obviously h...
متن کاملThe Real Holomorphy Ring and Sums of Powers in Rational and Elliptic Function Fields over The Field of Real Numbers
This thesis is devoted to a study of real holomorphy rings in R(x) and elliptic function fields R(x)( √ f(x)), f is a monic polynomial of degree 3 with no multiple roots in C over R and sums of powers in R(x). The objects of study are real valuation rings, real holomorphy rings and real places in the rational function fields R(x) and then investigate their extension to elliptic function fields ...
متن کاملRandomization, Sums of Squares, and Faster Real Root Counting for Tetranomials and Beyond
Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in logD on average (relative to the stable log-uniform measure), for counting the number of real roots of f . The best previous algorithms had complexity super-linear in D. We also discuss connections to sums of squares and A-discriminants, including explicit ...
متن کاملSums of Squares of Polynomials with Rational Coefficients
We construct families of explicit polynomials f over Q that are sums of squares of polynomials over R, but not over Q. Whether or not such examples exist was an open question originally raised by Sturmfels. We also study representations of f as sums of squares of rational functions over Q. In the case of ternary quartics, we prove that our counterexamples to Sturmfels’ question are the only ones.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009